Automorphism groups of some AG codes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the automorphism groups of some AG-codes based on Ca, b curves

We study Ca,b curves and their applications to coding theory. We show how Ca,b curves can be used to construct MDS codes and focus on some Ca,b curves with extra automorphisms, namely y 3 = x + 1, y = x − x, y − y = x. The automorphism groups of such codes are determined in most characteristics.

متن کامل

AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...

متن کامل

Automorphism groups of GRS codes

We look at AG codes associated to P1, re-examining the problem of determining their automorphism groups (originally investigated by Dür in 1987 using combinatorial techniques) using recent methods from algebraic geometry. We classify those finite groups that can arise as the automorphism group of an AG code and give an explicit description of how these groups appear. We give examples of general...

متن کامل

Automorphism groups of Grassmann codes

Article history: Received 9 May 2012 Revised 17 February 2013 Accepted 30 April 2013 Available online 14 May 2013 Communicated by Xiang-dong Hou MSC: 14M15 20B25 94B05 94B27

متن کامل

Simplicity of some automorphism groups

a r t i c l e i n f o a b s t r a c t Let M be a countably infinite first order relational structure which is homogeneous in the sense of Fraïssé. We show, under the assumption that the class of finite substructures of M has the free amalgamation property, along with the assumption that Aut(M) is transitive on M but not equal to Sym(M), that Aut(M) is a simple group. This generalises results of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2006

ISSN: 0018-9448

DOI: 10.1109/tit.2006.876243